Multiobjective optimization of dynamic aperture
نویسندگان
چکیده
منابع مشابه
Evolutionary Optimization of Dynamic Multiobjective Functions
Many real-world problems show both multiobjective as well as dynamic characteristics. In order to use multiobjective evolutionary optimization algorithms (MOEA) efficiently, a systematic analysis of the behavior of these algorithms in dynamic environments is necessary. Dynamic fitness functions can be classified into problems with moving Pareto fronts and Pareto sets having varying speed, shape...
متن کاملDynamic Archive Evolution Strategy for Multiobjective Optimization
This paper proposes a new multiobjective evolutionary approach the dynamic archive evolution strategy (DAES) to investigate the adaptive balance between proximity and diversity. In DAES, a novel dynamic external archive is proposed to store elitist individuals as well as relatively better individuals through archive increase scheme and archive decrease scheme. Additionally, a combinatorial ope...
متن کاملTransfer Learning based Dynamic Multiobjective Optimization Algorithms
One of the major distinguishing features of the dynamic multiobjective optimization problems (DMOPs) is the optimization objectives will change over time, thus tracking the varying Pareto-optimal front becomes a challenge. One of the promising solutions is reusing the “experiences” to construct a prediction model via statistical machine learning approaches. However most of the existing methods ...
متن کاملOptimization of Dynamic Aperture of Pep-X Baseline Design*
SLAC is developing a long‐range plan to transfer the evolving scientific programs at SSRL from the SPEAR3 light source to a much higher performing photon source. Storage ring design is one of the possibilities that would be housed in the 2.2‐km PEP‐II tunnel[1,2]. The design goal of PEPX storage ring is to approach an optimal light source design with horizontal emittance less than 100...
متن کاملMultiobjective dynamic optimization of a semi-batch epoxy polymerization process
Multiobjective Pareto optimal solutions for epoxy semi-batch polymerization process are obtained by adapting nondominated sorting genetic algorithm II (NSGA II). The objective is to produce polymer of maximum possible number average molecular weight (Mn) with a specified value of polydispersity index (PDI) and number average molecular weight in minimum possible time. The M and reaction time a p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Special Topics - Accelerators and Beams
سال: 2011
ISSN: 1098-4402
DOI: 10.1103/physrevstab.14.054001